Dummy

Eliminating Dummy Elimination

This paper is concerned with methods that automatically prove termination of term rewrite systems. The aim of dummy elimination, a method to prove termination introduced by Ferreira and Zantema, is to transform a given rewrite system into a rewrite system whose termination is easier to prove. We show that dummy elimination is subsumed by the more recent dependency pair method of Arts and Giesl....

Eliminating Dummy Elimination ?

Dummy Observation Priors for Var's *

As is documented elsewhere (Sims revised 1996, Sims 1998), there is a strong tendency for estimated time series models, when the estimates are based on a flat prior and on likelihood conditional on initial observations, to attribute unreasonable explanatory power to initial conditions. Since classical estimation methods (like OLS in simple unrestricted VAR’s) are close to flat-prior Bayesian me...

DUMMY A package to find the canonical form of expressions involving dummy variables

The possibility to handle dummy variables and to manipulate dummy summations are important features in many applications. In particular, in theoretical physics, the possibility to represent complicated expressions concisely and to realize simplifications efficiently depend on both capabilities. However, when dummy variables are used, there are many more ways to express a given mathematical obje...

Dummy Elimination: Making Termination Easier